Recent progress on weight distributions of cyclic codes over finite fields∗

نویسندگان

  • Hai Q. Dinh
  • Chengju Li
  • Qin Yue
چکیده

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. In coding theory it is often desirable to know the weight distribution of a cyclic code to estimate the error correcting capability and error probability. In this paper, we present the recent progress on the weight distributions of cyclic codes over finite fields, which had been determined by exponential sums. The cyclic codes with few weights which are very useful are discussed and their existence conditions are listed. Furthermore, we discuss the more general case of constacyclic codes and give some equivalences to characterize their weight distributions. 2010 MSC: 94B15, 11T71, 11T24

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the weight distributions of a class of cyclic codes

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases in [14, 15, 16]. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special case. We make extensive use of standard tools in number theory such as characters of finite fields, the Gauss sums and the Jacobi sums to tra...

متن کامل

The weight distributions of irreducible cyclic codes of length 2m

Let m be a positive integer and q be an odd prime power. In this short communication , the weight distributions of all the irreducible cyclic codes of length 2 m over F q are determined explicitly, directly from their generating polynomials.

متن کامل

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and crypt...

متن کامل

The weight distributions of two classes of p-ary cyclic codes with few weights

Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime p, the weight distributions of two classes of p-ary cyclic codes are completely determined. We show that both codes have at most five nonzero weights.

متن کامل

On period polynomials of degree 2m and weight distributions of certain irreducible cyclic codes

We explicitly determine the values of reduced cyclotomic periods of order 2, m ≥ 4, for finite fields of characteristic p ≡ 3 or 5 (mod 8). These evaluations are applied to obtain explicit factorizations of the corresponding reduced period polynomials. As another application, the weight distributions of certain irreducible cyclic codes are described.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015